منابع مشابه
Bounds for Test Exponents
Suppose that R is a two-dimensional normal standard-graded domain over a finite field. We prove that there exists a uniform Frobenius test exponent b for the class of homogeneous ideals in R generated by at most n elements. This means that for every ideal I in this class we have that f b ∈ I [p ] if and only if f ∈ I . This gives in particular a finite test for the Frobenius closure. On the oth...
متن کاملBounds for Disconnection Exponents
We improve the upper bounds of disconnection exponents for planar Brownian motion that we derived in an earlier paper. We also give a plain proof of the lower bound 1/(2π) for the disconnection exponent for one path.
متن کاملUperieure S Ormale N Ecole Bounds for Disconnection Exponents Bounds for Disconnection Exponents Bounds for Disconnection Exponents
We slightly inprove the upper bounds of disconnection exponents for planar Brownian motion that we derived in an earlier paper. We also give a plain proof of the lower bound 1=(2) for the disconnection exponent for one path.
متن کاملLocalization and Test Exponents for Tight Closure
We introduce the notion of a test exponent for tight closure, and explore its relationship with the problem of showing that tight closure commutes with localization, a longstanding open question. Roughly speaking, test exponents exist if and only if tight closure commutes with localization: mild conditions on the ring are needed to prove this. We give other, independent, conditions that are nec...
متن کاملNew Upper Bounds on Error Exponents
We derive new upper bounds on the error exponents for the maximum-likelihood decoding and error detecting in the binary symmetric channels. This is an improvement on the best earlier known bounds by Shannon–Gallager–Berlekamp (1967) and McEliece–Omura (1977). For the probability of undetected error the new bounds are better than the bounds by Levenshtein (1978, 1989) and the recent bound by Abd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Compositio Mathematica
سال: 2006
ISSN: 0010-437X,1570-5846
DOI: 10.1112/s0010437x05001843